CONNECTION FORMULAS AND IRREDUCIBILITY CONDITIONS FOR APPELL^|^rsquo;S F2
نویسندگان
چکیده
منابع مشابه
Connection formulas for general discrete Sobolev polynomials: Mehler-Heine asymptotics
In this paper the discrete Sobolev inner product 〈p, q〉 = ∫ p(x)q(x)dμ+ r ∑ i=0 Mi p (c)q(c) is considered, whereμ is a finite positive Borel measure supported on an infinite subset of the real line, c ∈ R and Mi 0, i = 0, 1, . . . , r. Connection formulas for the orthonormal polynomials associated with 〈., .〉 are obtained. As a consequence, for a wide class of measures μ, we give the Mehler–He...
متن کاملOn representation formulas and radiation conditions
Solutions of linear elliptic partial differential equations in unbounded domains can be represented by boundary potentials if they satisfy certain conditions at infinity. These radiation conditions depend on the fundamental solution chosen for the integral representation. We prove some basic results about radiation conditions in a rather general framework. Fundamental solutions G are considered...
متن کاملEffective Symbolic Protocol Analysis via Equational Irreducibility Conditions
We address a problem that arises in cryptographic protocol analysis when the equational properties of the cryptosystem are taken into account: in many situations it is necessary to guarantee that certain terms generated during a state exploration are in normal form with respect to the equational theory. We give a tool-independent methodology for state exploration, based on unification and narro...
متن کاملSum relations for multiple zeta values and connection formulas for the Gauss hypergeometric functions
We give an explicit representation for the sums of multiple zetastar values of fixed weight and height in terms of Riemann zeta values.
متن کاملTesting modules for irreducibility
A practical method is described for deciding whether or not a nite-dimensional module for a group over a nite eld is reducible or not. In the reducible case, an explicit submodule is found. The method is a generalisation of the Parker-Norton`Meataxe' algorithm, but it does not depend for its eeciency on the eld being small. The principal tools involved are the calculation of the nullspace and t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kyushu Journal of Mathematics
سال: 2012
ISSN: 1340-6116,1883-2032
DOI: 10.2206/kyushujm.66.325